Sorting strings and constructing digital search trees in parallel
نویسندگان
چکیده
منابع مشابه
Constructing Huffman Trees in Parallel
We present a parallel algorithm for the Huuman Coding problem. We reduce the Huuman Coding problem to the Concave Least Weight Subsequence problem and give a parallel algorithm that solves the latter problem in O(p n log n) time with n processors on a CREW PRAM. This leads to the rst sublinear time o(n 2)-total work parallel algorithm for Huuman Coding. This reduction of the Huuman Coding probl...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملOn Digital Search Trees - A Simple Method for Constructing Balanced Binary Trees
This paper presents digital search trees, a binary tree data structure that can produce well-balanced trees in the majority of cases. Digital search tree algorithms are reviewed, and a novel algorithm for building sorted trees is introduced. It was found that digital search trees are simple to implement because their code is similar to the code for ordinary binary search trees. Experimental eva...
متن کاملDigital Search Trees Revisited
Several algorithms have been proposed which build search trees using digital properties of the search keys. A general approach to the study of the average case performance of such algorithms is discussed, with particular attention to the analysis of the digital search tree structures of Coffman and Eve. Specifically, the method leads to the solution of a problem left open by Knuth, finding the ...
متن کاملprobabilistic analysis of the asymmetric digital search trees
in this paper, by applying three functional operators the previous results on the(poisson) variance of the external profile in digital search trees will be improved. we study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the poissonized variance, since the probability distribution of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00263-0